SMART PLANNER : Divide-and-Conquer with Soft Computing Approach
نویسندگان
چکیده
Data mining is an emerging area to discover knowledge from a tremendously large database or data warehouse. Plan mining is an extension activity of data mining. Given a set of plans, the objective is to enable user to know the interesting plans. With the proliferation of database technology, planbase are increasingly common.Efficient patterns of actions discovery, valuating the planbase, and deriving the concise plan is the current challenge to data mining. Soft computing is a consortium of intelligent techniques like Neural Networks, Fuzzy theory, evolutionary computing etc. This paper proposes a soft computing approach to develop a planminer. The attributes of the patterns of the planbase are fuzzified in the first phase. Next, support is associated to each plan. A rule base is generated which is input to a neural network for learning and prediction.
منابع مشابه
tBurton: A Divide and Conquer Temporal Planner
Planning for and controlling a network of interacting devices requires a planner that accounts for the automatic timed transitions of devices, while meeting deadlines and achieving durative goals. Consider a planner for an imaging satellite with a camera that cannot tolerate exhaust. The planner would need to determine that opening a valve causes a chain reaction that ignites the engine, and th...
متن کاملFree Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملOptimizing Skeletal Stream Processing for Divide and Conquer
Algorithmic skeletons intend to simplify parallel programming by providing recurring forms of program structure as predefined components. We present a new distributed task parallel skeleton for a very general class of divide and conquer algorithms for MIMD machines with distributed memory. Our approach combines skeletal internal task parallelism with stream parallelism. This approach is compare...
متن کاملKnowledge Reduction Based on Divide and Conquer Method in Rough Set Theory
The divide and conquer method is a typical granular computing method using multiple levels of abstraction and granulations. So far, although some achievements based on divided and conquer method in the rough set theory have been acquired, the systematic methods for knowledge reduction based on divide and conquer method are still absent. In this paper, the knowledge reduction approaches based on...
متن کاملFast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach
We consider a variety of preemptive scheduling problems with controllable processing times on a single machine and on identical/uniform parallel machines, where the objective is to minimize the total compression cost. In this paper, we propose fast divide-and-conquer algorithms for these scheduling problems. Our approach is based on the observation that each scheduling problem we discuss can be...
متن کامل